COMPUTING SCIENCE A Polynomial Translation of pi-Calculus (FCP) to Safe Petri Nets
نویسندگان
چکیده
We develop a polynomial translation from finite control processes (an important fragment of pi-calculus) to safe low-level Petri nets. To our knowledge, this is the first such translation. It is natural (there is a close correspondence between the control flow of the original specification and the resulting Petri net), enjoys a bisimulation result, and is suitable for practical model checking. © 2012 Newcastle University. Printed and published by Newcastle University, Computing Science, Claremont Tower, Claremont Road, Newcastle upon Tyne, NE1 7RU, England. Bibliographical details MEYER, R., KHOMENKO, V., HÜCHTING, R. A Polynomial Translation of pi-Calculus (FCP) to Safe Petri Nets [By] R. Meyer, V. Khomenko, R. Hüchting Newcastle upon Tyne: Newcastle University: Computing Science, 2012. (Newcastle University, Computing Science, Technical Report Series, No. CS-TR-1323)
منابع مشابه
A Polynomial Translation of π-Calculus (FCP) to Safe Petri Nets
We develop a polynomial translation from finite control processes (an important fragment of π-calculus) to safe low-level Petri nets. To our knowledge, this is the first such translation. It is natural (there is a close correspondence between the control flow of the original specification and the resulting Petri net), enjoys a bisimulation result, and is suitable for practical model checking.
متن کاملA Polynomial Translation of pi-calculus FCPs to Safe Petri Nets
We develop a polynomial translation from finite control π-calculus processes to safe low-level Petri nets. To our knowledge, this is the first such translation. It is natural in that there is a close correspondence between the control flows, enjoys a bisimulation result, and is suitable for practical model checking.
متن کاملA Practical Approach to Verification of Mobile Systems Using Net Unfoldings
In this paper we propose a technique for verification of mobile systems. We translate finite control processes, which are a well-known subset of pi-Calculus, into Petri nets, which are subsequently used for model checking. This translation always yields bounded Petri nets with a small bound, and we develop a technique for computing a non-trivial bound by static analysis. Moreover, we introduce ...
متن کاملA Petri Net Interpretation of Open Reconfigurable Systems
We present a Petri net interpretation of the pi-graphs a graphical variant of the pi-calculus. Characterizing labelled transition systems, the translation can be used to reason in Petri net terms about open reconfigurable systems. We demonstrate that the pi-graphs and their translated Petri nets agree at the semantic level. In consequence, existing results on pi-graphs naturally extend to the t...
متن کاملTranslating Safe Petri Nets to Statecharts in a Structure-Preserving Way
Statecharts and Petri nets are two popular visual formalisms for modelling complex systems that exhibit concurrency. Both formalisms are supported by various design tools. To enable the automated exchange of models between Petri net and statechart tools, we present a structural, polynomial algorithm that translates safe Petri nets into statecharts. The translation algorithm preserves both the s...
متن کامل